Rule-restricted Automaton-grammar transducers: Power and Linguistic Applications

This paper introduces the notion of a new transducer as a two-component system, which consists of a nite automaton and a context-free grammar. In essence, while the automaton reads its input string, the grammar produces its output string, and their cooperation is controlled by a set, which restricts the usage of their rules. From a theoretical viewpoint, the present paper discusses the power of this system working in an ordinary way as well as in a leftmost way. In addition, the paper introduces an appearance checking, which allows us to check whether some symbols are present in the rewritten string, and studies its e ect on the power. It achieves the following three main results. First, the system generates and accepts languages de ned by matrix grammars and partially blind multi-counter automata, respectively. Second, if we place a leftmost restriction on derivation in the context-free grammar, both accepting and generating power of the system is equal to generative power of context-free grammars. Third, the system with appearance checking can accept and generate all recursively enumerable languages. From more pragmatical viewpoint, this paper describes several linguistic applications. A special attention is paid to the Japanese-Czech translation

Modernizing of Dynamometer for Passenger Vehicle

Cílem této práce je navrhnout optimalizaci dané válcové zkušebny. Aby bylo možné provést optimalizaci stávající zkušebny, je nutné zjistit, jaké nedostatky válcová zkušebna má. Po zjištění nedostatků je třeba provést návrhy úprav válcové zkušebny. V práci je zjištěno, že válcová zkušebna nemá dostatečný brzdný výkon. Na základě tohoto zjištění jsou vybrány dvě varianty úprav. První je výměna dynamometru a druhá je vložení převodovky do válcové zkušebny. Na převodové skříni je provedena pevnostní analýza.The basic aim of this thesis is to design optimisation of the brake bench in question. For this kind of optimisation, it was necessary to ascertain which failings the current brake bench exhibited. After ascertaining such failings, design of modification to this brake bench must be performed. In terms of this thesis, it was ascertained that the brake bench has insufficient brake power. Based on this finding, two alternatives for modifications have been selected. The first is replacement of the dynamometer and the second is insertion of a gear box into the brake bench. Rigidity analysis was performed on the gear casing.

Reduction of simple semi-conditional grammars with respect to the number of conditional productions

The present paper discusses the descriptional complexity of simple semiconditional grammars with respect to the number of conditional productions. More specifically, it demonstrates that for every phrase-structure grammar, there exists an equivalent simple semi-conditional grammar that has no more than twelve conditional productions

Multi-island finite automata and their even computation

summary:This paper discusses $n$-island finite automata whose transition graphs can be expressed as $n$-member sequences of islands $i_1, i_2, \dots , i_n$, where there is a bridge leaving $i_j$ and entering $i_{j+1}$ for each $1 \leq j \leq n - 1$. It concentrates its attention on even computation defined as any sequence of moves during which these automata make the same number of moves in each of the islands. Under the assumption that these automata work only in an evenly computational way, the paper proves its main result stating that $n$-island finite automata and Rosebrugh-Wood $n$-parallel right-linear grammars are equivalent. Then, making use of this main result, it demonstrates that under this assumption, the language family defined by $n$-island finite automata is properly contained in that defined by $(n+1)$-island finite automata for all $n \geq 1$. The paper also points out that this infinite hierarchy occurs between the family of regular languages and that of context-sensitive languages. Open questions are formulated in the conclusion

Forbidding ET0L grammars

AbstractThe present paper introduces and discusses forbidding ET0L grammars whose productions have some attached strings, called forbidding conditions. These grammars can make a derivation step only by using productions whose forbidding conditions do not appear in the rewritten sentential form. The paper demonstrates that some well-known relationships concerning the language families resulting from ordinary ET0L grammars do not hold in terms of the forbidding ET0L grammars. Most interestingly, while E0L grammars are less powerful than ET0L grammars, their forbidding versions with conditions of length one are equally powerful. On the other hand, while EP0L grammars are as powerful as E0L grammars, FEP0L grammars are less powerful than FE0L grammars

Some Power-Decreasing Derivation Restrictions in Grammar Systems

In this paper, we place some left restrictions on derivations in CD grammar systems with phrase- structure grammars, controlled by the regular languages. The first restriction requires that every production is always applied within the first k nonterminals in every sentential form, for some $k \ge 1$. The second restriction says how many blocks of non-terminals can be in each sentential form. The third restriction extends the second restriction and says how many blocks of non-terminals with limited length can be in each sentential form. We demonstrate that under these restrictions, the grammar systems generate different families of languages. Indeed, under the first restriction, these systems generate only context-free languages. Under the second restriction, even one-component systems characterize the entire family of recursively enumerable languages. In the end, the family of languages generated by grammar systems under the third restriction is equal to the family of languages generated by programmed grammars with context-free rules without $\epsilon$- rules of nite index

Some Power-Decreasing Derivation Restrictions in Grammar Systems

In this paper, we place some left restrictions on derivations in CD grammar systems with phrase- structure grammars, controlled by the regular languages. The rst restriction requires that every production is always applied within the rst k nonterminals in every sentential form, for some k 1. The second restriction says how many blocks of non-terminals can be in each sentential form. The third restriction extends the second restriction and says how many blocks of non-terminals with limited length can be in each sentential form. We demonstrate that under these restrictions, the grammar systems generate dierent families of languages. Indeed, under the rst restriction, these systems generate only context-free languages. Under the second restriction, even one-component systems characterize the entire family of recursively enumerable languages. In the end, the family of languages generated by grammar systems under the third restriction is equal to the family of languages generated by programmed grammars with context-free rules without -rules of nite index